/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 17655
 * Date: 2025-03-02
 * Time: 13:01
 */
public class test3 {
    /**
     * LeetCode  最小花费爬楼梯
     */

    public int minCostClimbingStairs(int[] cost) {
        int n = cost.length;
        int[] dp = new int[n+1];
        dp[0] = 0;
        dp[1] = 0;
        for(int i=2;i<=n;i++){
            dp[i] = Math.min( (dp[i-1]+cost[i-1]),(dp[i-2]+cost[i-2]) );
        }
        return dp[n];
    }
}
